Geometric Mean Metric Learning
نویسندگان
چکیده
We revisit the task of learning a Euclidean metric from data. We approach this problem from first principles and formulate it as a surprisingly simple optimization problem. Indeed, our formulation even admits a closed form solution. This solution possesses several very attractive properties: (i) an innate geometric appeal through the Riemannian geometry of positive definite matrices; (ii) ease of interpretability; and (iii) computational speed several orders of magnitude faster than the widely used LMNN and ITML methods. Furthermore, on standard benchmark datasets, our closed-form solution consistently attains higher classification accuracy.
منابع مشابه
A Differential Geometric Approach to the Geometric Mean of Symmetric Positive-Definite Matrices
In this paper we introduce metric-based means for the space of positive-definite matrices. The mean associated with the Euclidean metric of the ambient space is the usual arithmetic mean. The mean associated with the Riemannian metric corresponds to the geometric mean. We discuss some invariance properties of the Riemannian mean and we use differential geometric tools to give a characterization...
متن کاملGeometric Modeling of Dubins Airplane Movement and its Metric
The time-optimal trajectory for an airplane from some starting point to some final point is studied by many authors. Here, we consider the extension of robot planer motion of Dubins model in three dimensional spaces. In this model, the system has independent bounded control over both the altitude velocity and the turning rate of airplane movement in a non-obstacle space. Here, in this paper a g...
متن کاملA new metric on the manifold of kernel matrices with application to matrix geometric means
Symmetric positive definite (spd) matrices pervade numerous scientific disciplines, including machine learning and optimization. We consider the key task of measuring distances between two spd matrices; a task that is often nontrivial whenever the distance function must respect the non-Euclidean geometry of spd matrices. Typical non-Euclidean distance measures such as the Riemannian metric δR(X...
متن کاملMetric Learning on Manifolds
In recent years, manifold learning has become increasingly popular as a tool for performing nonlinear dimensionality reduction. This has led to the development of numerous algorithms of varying degrees of complexity that aim to recover manifold geometry using either local or global features of the data. Building on the Laplacian Eigenmap framework, we propose a new paradigm that offers a guaran...
متن کاملRiemannian Metric and Geometric Mean for Positive Semidefinite Matrices of Fixed Rank
This paper introduces a new metric and mean on the set of positive semidefinite matrices of fixed-rank. The proposed metric is derived from a well-chosen Riemannian quotient geometry that generalizes the reductive geometry of the positive cone and the associated natural metric. The resulting Riemannian space has strong geometrical properties: it is geodesically complete, and the metric is invar...
متن کامل